1

Higher Order Unification via Explicit Substitutions

Year:
2000
Language:
english
File:
PDF, 481 KB
english, 2000
2

Proof of termination of the rewriting system subst on CCL

Year:
1986
Language:
english
File:
PDF, 407 KB
english, 1986
8

Functional back-ends within the lambda-sigma calculus

Year:
1996
Language:
english
File:
PDF, 883 KB
english, 1996
13

Theoretical Pearl Yet yet a counterexample for λ+SP

Year:
1994
Language:
english
File:
PDF, 133 KB
english, 1994
14

Functional runtime systems within the lambda-sigma calculus

Year:
1998
Language:
english
File:
PDF, 517 KB
english, 1998